Optimal subspace codes in ${\rm PG}(4,q)$
نویسندگان
چکیده
We investigate subspace codes whose codewords are subspaces of PG(4, q) having non– constant dimension. In particular, examples of optimal mixed–dimension subspace codes are provided, showing that Aq(5, 3) = 2(q 3 + 1).
منابع مشابه
Subspace Codes in PG(2N - 1, Q)
An (r,M, 2δ; k)q constant–dimension subspace code, δ > 1, is a collection C of (k−1)–dimensional projective subspaces of PG(r−1, q) such that every (k−δ)–dimensional projective subspace of PG(r−1, q) is contained in at most a member of C. Constant–dimension subspace codes gained recently lot of interest due to the work by Koetter and Kschischang [18], where they presented an application of such...
متن کاملOn the extendability of particular classes of constant dimension codes
In classical coding theory, different types of extendability results of codes are known. A classical example is the result stating that every (4, q − 1, 3)-code over an alphabet of order q is extendable to a (4, q, 3)-code. A constant dimension subspace code is a set of (k− 1)-spaces in the projective space PG(n− 1, q), which pairwise intersect in subspaces of dimension upper bounded by a speci...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملConstruction of Optimal Linear Codes by Geometric Puncturing
Geometric puncturing is a method to construct new codes from a given [n, k, d]q code by deleting the coordinates corresponding to some geometric object in PG(k − 1, q). We construct [gq(4, d), 4, d]q and [gq(4, d)+1, 4, d]q codes for some d by geometric puncturing, where gq(k, d) = ∑k−1 i=0 ⌈
متن کاملA characterization of quadrics by intersection numbers
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. Hertel and Pott obtain a characterization of some binary quasi-quadrics in a ne spaces by their intersection numbers with hyperplanes and spaces of codimension 2. We obtain a similar characterization for quadrics in pr...
متن کامل